- shortest path solver
- AG построитель кратчайшего маршрута
Англо-русский толковый словарь по геоинформатике. В.Ю. Андрианов. 2015.
Англо-русский толковый словарь по геоинформатике. В.Ю. Андрианов. 2015.
Solver (computer science) — A solver is a piece of mathematical software, possible in the form of a stand alone computer program or possibly as a software library that solves equations or systems of equations of one or more different types. These can include solutions to:*… … Wikipedia
Maze solving algorithm — There are a number of different maze solving algorithms, that is, automated methods for the solving of mazes. A few important maze solving algorithms are explained below. The random mouse, wall follower, Pledge, and Trémaux algorithms are… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
Quantitative comparative linguistics — is a branch of comparative linguistics that applies mathematical models to the problem of classifying language relatedness. This includes the use of computational phylogenetics and cladistics to define an optimal tree (or network) to represent a… … Wikipedia
LEMON (C++ library) — LEMON is an open source graph library written in C++ language. It is quite a useful tool for solving optimization problems. This means that LEMON can be a basis for applications solving different kind of optimization problems and also a starting… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Six degrees (disambiguation) — Six degrees may refer to:*Six degrees of separation, the theory that anyone on earth can be connected to any other person on the planet through a chain of acquaintances that has no more than five intermediaries *Six degrees of freedom, motion in… … Wikipedia
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Chess problem — Part of a series on Puzzles … Wikipedia
Kinematics — Classical mechanics Newton s Second Law History of classical mechanics … Wikipedia